EXACT SOLUTION METHODS FOR CYCLIC FAIR SEQUENCE PROBLEM
نویسندگان
چکیده
منابع مشابه
Exact Solution Methods for the k-Item Quadratic Knapsack Problem
The purpose of this paper is to solve the 0-1 k-item quadratic knapsack problem (kQKP ), a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization. The semidefinite relaxation used in our approach includes simple rank one constraints, which can be handled efficiently by interior point methods. Furthermore, we st...
متن کاملExact methods for the resource levelling problem
Project management in the present time is characterized by rapid advancements in many technologies, hardly calculable risks and very tight deadlines for nearly all kinds of projects. Planning and steering of projects under these conditions turns out to be a really tough job even for the most experienced project managers. To deal responsibly with project sponsors or customers, they must consider...
متن کاملA New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines. The objective pursued is to minimize the completion time of the set of operations. We investigate a relaxation of the problem related to the traveling salesman pro...
متن کاملAn exact solution for the Segment-to-Segment multiple sequence alignment problem
MOTIVATION In molecular biology, sequence alignment is a crucial tool in studying the structure and function of molecules, as well as the evolution of species. In the segment-to-segment variation of the multiple alignment problem, the input can be seen as a set of non-gapped segment pairs (diagonals). Given a weight function that assigns a weight score to every possible diagonal, the goal is to...
متن کاملA New Solution Approach for the Integer Fair Division Problem
In this paper, a solution method for classical fair division problem utilizing cut-and-choose protocol has been examined and a new method has been suggested in order to eliminate the deficiencies of that method. Furthermore, the problem has been generalized and mathematical models have been written according to oddness or evenness of the number of persons and solution techniques have been given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Operations Research Society of Japan
سال: 2012
ISSN: 1349-8940,2188-8280
DOI: 10.15807/torsj.55.149